Online Learning Video Recommendation System Based on Course and Sylabus Using Content-Based Filtering

Learning using video media such as watching videos on YouTube is an alternative method of learning that is often used. However, there are so many learning videos available that finding videos with the right content is difficult and time-consuming. Therefore, this study builds a recommendation system that can recommend videos based on courses and syllabus. The recommendation system works by looking for similarity between courses and syllabus with video annotations using the cosine similarity method. The video annotation is the title and description of the video captured in real-time from YouTube using the YouTube API. This recommendation system will produce recommendations in the form of five videos based on the selected courses and syllabus. The test results show that the average performance percentage is 81.13% in achieving the recommendation system goals, namely relevance, novelty, serendipity and increasing recommendation diversity

Local Triangular Kernel-Based Clustering (LTKC) for Case Indexing on Case-Based Reasoning

This study aims to improve the performance of Case-Based Reasoning by utilizing cluster analysis which is used as an indexing method to speed up case retrieval in CBR. The clustering method uses Local Triangular Kernel-based Clustering (LTKC). The cosine coefficient method is used for finding the relevant cluster while similarity value is calculated using Manhattan distance, Euclidean distance, and Minkowski distance. Results of those methods will be compared to find which method gives the best result. This study uses three test data: malnutrition disease, heart disease, and thyroid disease. Test results showed that CBR with LTKC-indexing has better accuracy and processing time than CBR without indexing. The best accuracy on threshold 0.9 of malnutrition disease, obtained using the Euclidean distance which produces 100% accuracy and 0.0722 seconds average retrieval time. The best accuracy on threshold 0.9 of heart disease, obtained using the Minkowski distance which produces 95% accuracy and 0.1785 seconds average retrieval time. The best accuracy on threshold 0.9 of thyroid disease, obtained using the Minkowski distance which produces 92.52% accuracy and 0.3045 average retrieval time. The accuracy comparison of CBR with SOM-indexing, DBSCAN-indexing, and LTKC-indexing for malnutrition diseases and heart disease resulted that they have almost equal accuracy

Chatbot in Bahasa Indonesia using NLP to Provide Banking Information

FAQs are mostly provided on the company's website to inform their service and product. It's just that the FAQ is usually less interactive and presents too much information that is less practical. Chatbot can be used as an alternative in providing FAQ. In this study, chatbots were developed for BTPN in providing information about their products, namely Jenius. Chatbot developed utilizes natural language processing so that the system can understand user queries in the form of natural language. The cosine similarity algorithm is used to find similarities between queries and patterns in the knowledge base. Patterns with the highest cosine values are considered to be most similar to user queries. It's just that, this algorithm does not pay attention to the structure of the sentence so that it adds checking the structure of the sentence with the parse tree to give weight to the pattern. This chatbot application has been tested by 10 users and it was found that the suitability of the answers with user input was 84%. Therefore the chatbot developed can be used by BTPN to provide Jenius product information to consumers more interactively and practically

Identification of Rice Variety Using Geometric Features and Neural Network

 Indonesia has many food varieties, one of which is rice varieties. Each rice variety has physical characteristics that can be recognized through color, texture, and shape. Based on these physical characteristics, rice can be identified using the Neural Network. Research using 12 features has not optimal results. This study proposes the addition of geometry features with Learning Vector Quantization and Backpropagation algorithms that are used separately.The trial uses data from 9 rice varieties taken from several regions in Yogyakarta. The acquisition of rice was carried out using a camera Canon D700 with a kit lens and maximum magnification, 55 mm. Data sharing is carried out for training and testing, and the training data was sharing with the quality of the rice. Preprocessing of data was carried out before feature extraction with the trial and error thresholding process of segmentation. Evaluation is done by comparing the results of the addition of 6 geometry features and before adding geometry features.The test results show that the addition of 6 geometry features gives an increase in the value of accuracy. This is evidenced by the Backpropagation algorithm resulting in increased accuracy of 100% and 5.2% the result of the LVQ algorithm

FVEC feature and Machine Learning Approach for Indonesian Opinion Mining on YouTube Comments

Mining opinions from Indonesian comments from YouTube videos are required to extract interesting patterns and valuable information from consumer feedback. Opinions can consist of a combination of sentiments and topics from comments. The features considered in the mining of opinion become one of the important keys to getting a quality opinion. This paper proposes to utilize FVEC and TF-IDF features to represent the comments. In addition, two popular machine learning approaches in the field of opinion mining, i.e., SVM and CNN, are explored separately to extract opinions in Indonesian comments of YouTube videos. The experimental results show that the use of FVEC features on SVM and CNN achieves a very significant effect on the quality of opinions obtained, in term of accuracy

Recommendation System for Thesis Topics Using Content-based Filtering

 When pursuing their bachelor degree, every students are required to pursue a thesis in order to graduate from the major that they take. However, during the process, students got several difficulty regarding chosing their thesis topics. Therefore, a recommendation system is needed to classify thesis topics based on the students’ interest and abilities. This study developed a recommendation system for thesis topics using content-based filtering where the students will be asked to choose the course that they interested in along with their grades. After getting all the required data, the recommendation system will process the data and then it’ll show the title and the abstract of publication that fits the criteria.In this research, there are 2 datasets that is used, there are lecturer publication within 3 years and syllabus data of Computer Science UGM course. After running this research, it was found that the recommendation system has an average 7.46 seconds running time. It was also found that the recommendation system got an average 83% of the recommendation system objectives. The recommendation system objectives consist of relevance, novelty, serendipity, and increasing recommendation diversity

Improved pattern extraction scheme for clustering multidimensional data

Multidimensional data refers to data that contains at least three attributes or dimensions. The availability of huge amount of multidimensional data that has been collected over the years has greatly challenged the ability to digest the data and to gain useful knowledge that would otherwise be lost. Clustering technique has enabled the manipulation of this knowledge to gain an interesting pattern analysis that could benefit the relevant parties. In this study, three crucial challenges in extracting the pattern of the multidimensional data are highlighted: the dimension of huge multidimensional data requires efficient exploration method for the pattern extraction, the need for better mechanisms to test and validate clustering results and the need for more informative visualization to interpret the “best” clusters. Densitybased clustering algorithms such as density-based spatial clustering application with noise (DBSCAN), density clustering (DENCLUE) and kernel fuzzy C-means (KFCM) that use probabilistic similarity function have been introduced by previous works to determine the number of clusters automatically. However, they have difficulties in dealing with clusters of different densities, shapes and size. In addition, they require many parameter inputs that are difficult to determine. Kernel-nearestneighbor (KNN)-density-based clustering including kernel-nearest-neighbor-based clustering (KNNClust) has been proposed to solve the problems of determining smoothing parameters for multidimensional data and to discover cluster with arbitrary shape and densities. However, KNNClust faces problem on clustering data with different size. Therefore, this research proposed a new pattern extraction scheme integrating triangular kernel function and local average density technique called TKC to improve KNN-density-based clustering algorithm. The improved scheme has been validated experimentally with two scenarios: using real multidimensional spatio-temporal data and using various classification datasets. Four different measurements were used to validate the clustering results; Dunn and Silhouette index to assess the quality, F-measure to evaluate the performance of approach in terms of accuracy, ANOVA test to analyze the cluster distribution, and processing time to measure the efficiency. The proposed scheme was benchmarked with other well-known clustering methods including KNNClust, Iterative Local Gaussian Clustering (ILGC), basic k-means, KFCM, DBSCAN and DENCLUE. The results on the classification dataset demonstrated that TKC produced clusters with higher accuracy and more efficient than other clustering methods. In addition, the analysis of the results showed that the proposed TKC scheme is capable of handling multidimensional data, validated by Silhouette and Dunn index which was close to one, indicating reliable results

GSA to Obtain SVM Kernel Parameter for Thyroid Nodule Classification

Support Vector Machine (SVM) is one of the most popular methods of classification problems due to its global optima solution. However, the selection of appropriate parameters and kernel values remains an obstacle in the process. The problem can be solved by adding the best value of parameter during optimization process in SVM. Gravitational Search Algorithm (GSA) will be used to optimize parameters of SVM. GSA is an optimization algorithm that is inspired by mass interaction and Newton's law of gravity. This research hybridizes the GSA and SVM  to increase system accuracy. The proposed approach had been implemented to improve the classification performance of Thyroid Nodule. The data used in this research are ultrasonography image of Thyroid Nodule obtained from RSUP Dr. Sardjito, Yogyakarta. This research had been evaluated by comparing the default SVM parameters with the proposed method in term of accuracy. The experiment results showed that the use of GSA on SVM is capable to increase system accuracy. In the polynomial kernel the accuracy rose up from 58.5366 % to 89.4309 %, and 41.4634 % to 98.374 % in Polynomial kerne

Fast Non-dominated Sorting in Multi Objective Genetic Algorithm for Bin Packing Problem

The bin packing problem is a problem where goods with different volumes and dimensions are put into a container so that the volume of goods inserted is maximized. The problem of multi-objective bin packing is a problem that is more commonly found in everyday life, because what is considered in packing is usually not only volume.In this research, a multi-objective genetic algorithm is proposed to solve the multi-objective bin packing problem. The proposed genetic algorithm uses non-dominated sorting and crowding distance methods to get the best solution for each objective and to avoid bias. The algorithm is then tested with several test classes that represent different combinations of item and container sizes.From the results of the tests carried out, it was found that the proposed algorithm can find several solutions which are the best candidate solutions for each objective. Also found how the correlation of each objective in the population

Siamese-Network Based Signature Verification using Self Supervised Learning

The use of signatures is often encountered in various public documents ranging from academic documents to business documents that are a sign that the existence of signatures is crucial in various administrative processes. The frequent use of signatures does not mean a procedure without loopholes, but we must remain vigilant against signature falsification carried out with various motives behind it. Therefore, in this study, a signature verification system was developed that could prevent the falsification of signatures in public documents by using digital imagery of existing signatures. This study used neural networks with siamese network-based architectures that also empower self-supervised learning techniques to improve accuracy in the realm of limited data. The final evaluation of the machine learning method used gets a maximum accuracy of 83% and this result is better than the machine learning model that does not involve self-supervised learning methods